Performance analysis of bid calculation methods in multirobot market-based task allocation
نویسندگان
چکیده
In this study, the empirical results of a market-based task allocation method for heterogeneous and homogeneous robot teams and different types of tasks in 2 different environments are presented. The proposed method allocates robots to tasks through a parallel multiitem auction-based process. The main contribution of the proposed method is energy-based bid calculations, which take into account both the heterogeneity of the robot team and features of the tasks. The multirobot task allocation problem is considered as the optimal assignment problem and the Hungarian algorithm is used to clear the auctions. Simulations are carried out using energy-based, distance-based, and time-based bid calculation methods. The methods are implemented using a 3-type task set: cleaning a space, carrying an object, and monitoring. The tasks may have different sensitivities and/or priority levels. Simulations show that robot-task allocations of all of the methods result in similar utility values when single-type and/or same-featured tasks are used. However, for different-type and/or different-featured tasks, the proposed energy-based bid calculation method assigns a greater number of high-sensitivity tasks compared to the other 2 methods while consuming almost the same amount of energy in both environments. Additionally, the energy-based method has a filtering behavior for high-priority tasks. These properties of the proposed method increase the efficiency of the robot team.
منابع مشابه
Enhanced Negotiation and Opportunistic Optimization for Market-Based Multirobot Coordination
Multirobot coordination, if made efficient and robust, promises high impact on automation. The challenge is to enable robots to work together in an intelligent manner to execute a global task. The market approach has had considerable success in the multirobot coordination domain. However the implementation of this approach to date restricts the negotiations to two-party, single-task deals which...
متن کاملMarket-based Multirobot Coordination for Complex Tasks
Current technological developments and application-driven demands are bringing us closer to the realization of autonomous multirobot systems performing increasingly complex missions. However, existing methods of distributing mission subcomponents among multirobot teams do not explicitly handle the required complexity and instead treat tasks as simple indivisible entities, ignoring any inherent ...
متن کاملAn Auction-Based Approach to Complex Task Allocation for Multirobot Teams
Current technological advances and application-driven demands are leading to the development of autonomous multirobot systems able to perform increasingly complex missions. However, existing methods of distributing mission subcomponents among multirobot teams do not explicitly handle this complexity and instead treat tasks as simple indivisible entities, ignoring any inherent structure and sema...
متن کاملMarket-Based Multirobot Coordination Using Task Abstraction
In this paper, we introduce a novel approach to multirobot coordination that works by simultaneously distributing task allocation, mission planning, and execution among members of a robot team. By combining traditional hierarchical task decomposition techniques with recent developments in market-based multirobot control, we obtain an efficient and robust distributed system capable of solving co...
متن کاملOptimal Market-based Multi-Robot Task Allocation via Strategic Pricing
Auction and market-based mechanisms are among the most popular methods for distributed task allocation in multirobot systems. Most of these mechanisms were designed in a heuristic way and analysis of the quality of the resulting assignment solution is rare. This paper presents a new market-based multi-robot task allocation algorithm that produces optimal assignments. Rather than adopting a buye...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013